Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("OR algorithm")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 167453

  • Page / 6699
Export

Selection :

  • and

Sur l'usage de la formule de Cauchy―Binet dans les démonstrations de convergence de l'algorithme QR tri-diagonal avec décalages = Using the Cauchy-Binet formula in the convergence proof of the tridiagonal QR algorithm with shiftsCUER, Michel.Comptes rendus. Mathématique. 2011, Vol 349, Num 23-24, pp 1293-1296, issn 1631-073X, 4 p.Article

Generalization : One technique of computational and applied mathematical methodologyDE SAMPAIO, Raimundo J. B; YUAN, S; YUAN, J. Y et al.Applied mathematics and computation. 2008, Vol 200, Num 2, pp 574-582, issn 0096-3003, 9 p.Conference Paper

Accelerating the quadratic lower-bound algorithm via optimizing the shrinkage parameterTIAN, Guo-Liang; TANG, Man-Lai; CHUNLING LIU et al.Computational statistics & data analysis. 2012, Vol 56, Num 2, pp 255-265, issn 0167-9473, 11 p.Article

Non Asymptotic Minimax Estimation of Functionals with Noisy ObservationsDARKHOVSKIY, Boris.Communications in statistics. Simulation and computation. 2012, Vol 41, Num 6-7, pp 787-803, issn 0361-0918, 17 p.Conference Paper

A LINEAR TIME ALGORITHM FOR NEAR MINIMAX CONTINUOUS PIECEWISE LINEAR REPRESENTATIONS OF DISCRETE DATASZUSZ, Emily K; WILLMS, Allan R.SIAM journal on scientific computing (Print). 2011, Vol 32, Num 5, pp 2584-2602, issn 1064-8275, 19 p.Article

FAST FOURIER TRANSFORMS FOR THE ROOK MONOIDMALANDRO, Martin; ROCKMORE, Dan.Transactions of the American Mathematical Society. 2010, Vol 362, Num 2, pp 1009-1045, issn 0002-9947, 37 p.Article

OPTIMAL IMPORTANCE SAMPLING PARAMETER SEARCH FOR LÉVY PROCESSES VIA STOCHASTIC APPROXIMATIONKAWAI, Reiichiro.SIAM journal on numerical analysis. 2010, Vol 47, Num 1, pp 293-307, issn 0036-1429, 15 p.Article

A GENERAL APPROACH FOR INCREMENTAL APPROXIMATION AND HIERARCHICAL CLUSTERINGGUOLONG LIN; NAGARAJAN, Chandrashekhar; RAJARAMAN, Rajmohan et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3633-3669, issn 0097-5397, 37 p.Article

SMOOTHING-NORM PRECONDITIONING FOR REGULARIZING MINIMUM-RESIDUAL METHODSHANSEN, Per Christian; JENSEN, Toke Koldborg.SIAM journal on matrix analysis and applications. 2008, Vol 29, Num 1, pp 1-14, issn 0895-4798, 14 p.Article

A model for understanding numerical stabilityBORNEMANNT, Folkmar.IMA journal of numerical analysis. 2007, Vol 27, Num 2, pp 219-231, issn 0272-4979, 13 p.Article

CDT like approaches for the system of nonlinear equationsNIE, Pu-Yan.Applied mathematics and computation. 2006, Vol 172, Num 2, pp 892-902, issn 0096-3003, 11 p.Article

A genetic algorithm approach to find the best regression/econometric model among the candidatesHASHEMINIA, Hamed; SEYED TAGHI AKHAVAN NIAKI.Applied mathematics and computation. 2006, Vol 183, Num 1, pp 337-349, issn 0096-3003, 13 p.Article

Statistical inference for discretely observed Markov jump processesBLADT, Mogens; SØRENSEN, Michael.Journal of the Royal Statistical Society. Series B, statistical methodology. 2005, Vol 67, pp 395-410, issn 1369-7412, 16 p., 3Article

Approximated transient queue length and waiting time distributions via steady state analysisVAN HOUDT, B; BLONDIA, C.Stochastic models. 2005, Vol 21, Num 2-3, pp 725-744, issn 1532-6349, 20 p.Conference Paper

Modelling language development and evolution with the benefit of hindsightVAN DER VELDE, Frank.Connection science (Print). 2005, Vol 17, Num 3-4, pp 361-379, issn 0954-0091, 19 p.Article

Numerical solution of inverse scattering problems with multi-experimental limited aperture dataGANG BAO; JUN LIU.SIAM journal on scientific computing (Print). 2004, Vol 25, Num 3, pp 1102-1117, issn 1064-8275, 16 p.Article

Fast computation of MD-DCT-IV/MD-DST-IV by MD-DWT or MD-DCT-IIYONGHONG ZENG; ZHIPING LIN; GUOAN BI et al.SIAM journal on scientific computing (Print). 2003, Vol 24, Num 6, pp 1903-1918, issn 1064-8275, 16 p.Article

Multidisk problems in H∞ optimization: A method for analysing numerical algorithmsDYM, Harry; HELTON, J. William; MERINO, Orlando et al.Indiana University mathematics journal. 2002, Vol 51, Num 5, pp 1111-1159, issn 0022-2518, 49 p.Article

Consensus models: Computational complexity aspects in modern approaches to the list coloring problemBOGDANOWICZ, Damian; GIARO, Krzysztof; JANCZEWSKI, Robert et al.Theoretical computer science. 2011, Vol 412, Num 35, pp 4721-4728, issn 0304-3975, 8 p.Article

Particle swarm optimization: Hybridization perspectives and experimental illustrationsTHANGARAJ, Radha; PANT, Millie; ABRAHAM, Ajith et al.Applied mathematics and computation. 2011, Vol 217, Num 12, pp 5208-5226, issn 0096-3003, 19 p.Article

The nonparametric maximum likelihood estimator for middle-censored dataSHEN, Pao-Sheng.Journal of statistical planning and inference. 2011, Vol 141, Num 7, pp 2494-2499, issn 0378-3758, 6 p.Article

The spatial continuity study of NDVI based on Kriging and BPNN algorithmYUJIAN YANG; JIANHUA ZHU; CHUNJIANG ZHAO et al.Mathematical and computer modelling. 2011, Vol 54, Num 3-4, pp 1138-1144, issn 0895-7177, 7 p.Article

AN LLL ALGORITHM WITH QUADRATIC COMPLEXITYNGUYEN, Phong Q; STEHLE, Damien.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 874-903, issn 0097-5397, 30 p.Article

Dynamic programming based algorithms for set multicover and multiset multicover problemsHUA, Qiang-Sheng; YUEXUAN WANG; DONGXIAO YU et al.Theoretical computer science. 2010, Vol 411, Num 26-28, pp 2467-2474, issn 0304-3975, 8 p.Article

Priority algorithms for graph optimization problemsBORODIN, Allan; BOYAR, Joan; LARSEN, Kim S et al.Theoretical computer science. 2010, Vol 411, Num 1, pp 239-258, issn 0304-3975, 20 p.Article

  • Page / 6699